Feasible formation of coalitions among autonomous agents in non-super-additive environments

Cooperating and sharing resources by creating coalitions of agents are an important way for autonomous agents to execute tasks and to maximize payo . Such coalitions will form only if each member of a coalition gains more if it joins the coalition than it could gain otherwise. There are several ways of creating such coalitions and dividing the joint payo among the members. In this paper we present algorithms for coalition formation and payo distribution in non-super-additive environments. We focus on a low-complexity kernel-oriented coalition formation algorithm. The properties of this algorithm were examined via simulations. These have shown that the model increases the bene ts of the agents within a reasonable time period, and more coalition formations provide more bene ts to the agents.